排序方式: 共有70条查询结果,搜索用时 156 毫秒
51.
52.
陈兴国 《军械工程学院学报》1989,(2)
本文针对微机数控中检测一轴的运动、控制另一轴运动的定比运动,提出了一个控制速度插补的算法,证明了这种方法的最小误差特点,并进行了误差分析。 相似文献
53.
分析了铜包钢和铜导线内导体同轴电缆的电性能检测实验,从而证实复合导线的高电导特性,并指出该特性的应用前景和实用价值. 相似文献
54.
在格型矢量量化中,用格点作为量化矢量,构成码书。为了存储或传输量化输出,必须对格点进行标号。我们在数据压缩课题研究中,对塔式网格矢量量化中格点的标号进行了探索,给出了常用的几种网络诸如ZL、DL、E8、A16等格点的标号算法。 相似文献
55.
介绍了3 种计算亚音速栅格翼与弹身气动干扰的方法,并用其中的2种方法进行了计算,所得结论与流场分析所得结论相同,证明了这两种方法在计算弹身与弹翼气动干扰方面的可用性和正确性。 相似文献
56.
57.
本文从热膨胀系数α、比热C_v 及体积弹性模量K 所满足的热力学关系出发,提出了一种简单实用的递推方法计算热膨胀系数,用此方法可以相当准确地计算固体热膨胀系数作为温度函数的整个曲线。文中以三种碱卤晶体为例计算了室温以下的热膨胀系数,与实验结果符合得非常好。 相似文献
58.
We develop a simple, approximately optimal solution to a model with Erlang lead time and deterministic demand. The method is robust to misspecification of the lead time and has good accuracy. We compare our approximate solution to the optimal for the case where we have prior information on the lead‐time distribution, and another where we have no information, except for computer‐generated sample data. It turns out that our solution is as easy as the EOQ's, with an accuracy rate of 99.41% when prior information on the lead‐time distribution is available and 97.54–99.09% when only computer‐generated sample information is available. Apart from supplying the inventory practitioner with an easy heuristic, we gain insights into the efficacy of stochastic lead time models and how these could be used to find the cost and a near‐optimal policy for the general model, where both demand rate and lead time are stochastic. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004 相似文献
59.
对某重型柴油机机油在使用过程中混入柴油、冷却液、烟炱等污染的情况进行模拟试验,在纯净的机油中分别混入柴油、冷却液和烟炱并搅拌均匀,配成不同百分比的模拟污染油液,利用油品传感器FPS(Fluid PropertySensor)测量模拟污染油液的黏度、介电常数和温度。试验表明:当机油中混入柴油、冷却液和烟炱时,机油的黏度或介电常数随着混入的百分比变化而变化;试验得出了它们之间的定量关系式。通过实车机油质量的检测认为:该方法可以用于机油的在线监测,为机油的按质换油提供监测方法和手段。 相似文献
60.
This article studies the classical single‐item economic lot‐sizing problem with constant capacities, fixed‐plus‐linear order costs, and concave inventory costs, where backlogging is allowed. We propose an O(T3) optimal algorithm for the problem, which improves upon the O(T4) running time of the famous algorithm developed by Florian and Klein (Manage Sci18 (1971) 12–20). Instead of using the standard dynamic programming approach by predetermining the minimal cost for every possible subplan, we develop a backward dynamic programming algorithm to obtain a more efficient implementation. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012 相似文献